- state minimization
- Программирование: минимизация состояний
Универсальный англо-русский словарь. Академик.ру. 2011.
state minimization
Смотреть что такое "state minimization" в других словарях:
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called … Wikipedia
Energy minimization — (energy optimization) methods are common techniques to compute the equilibrium configuration of molecules. The basic idea is that a stable state of a molecular system should correspond to a local minimum of their potential energy. This kind of… … Wikipedia
Partitioning minimization procedure — A fairly simple procedure to reduce the number of states in a state machine transition table.A partition denoted p1...p2...p3..etc. consists of one or more blocks where each block contains that may be equivalent but the states in a given block… … Wikipedia
Equation of State Calculations by Fast Computing Machines — is an article published by Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller in the Journal of Chemical Physics in 1953.cite journal |author=N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A … Wikipedia
Dfa minimization — DFA Deterministic Finite Automata is very Famous in Theory of Computation .it often requires to build a DFA which has minimum number of states.following is the algorithm that produces a optimal DFA from a DFA.1.Eliminate all self loops (because… … Wikipedia
Logic synthesis — is a process by which an abstract form of desired circuit behavior (typically register transfer level (RTL) or behavioral) is turned into a design implementation in terms of logic gates. Common examples of this process include synthesis of HDLs,… … Wikipedia
Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized … Wikipedia
Taylor Booth — Taylor L. Booth (d. October 20, 1986) was a mathematician specialized in automata theory.One of his fundamental works is Sequential Machines and Automata Theory (1967). It is a wide ranging book meant for specialists, written for both theoretical … Wikipedia
Pontryagin's minimum principle — Pontryagin s maximum (or minimum) principle is used in optimal control theory to find the best possible control for taking a dynamical system from one state to another, especially in the presence of constraints for the state or input controls. It … Wikipedia
